#include"add.h"

void test_1()
{
	cr::priority_queue<int,vector<int>,cr::Greater<int>> pq;
	pq.push(5);
	pq.push(1);	
	pq.push(3);
	pq.push(4);
	pq.push(2);

	while (!pq.empty())
	{
		cout << pq.top() << endl;
		pq.pop();
	}
}
int main()
{	
	test_1();
	vector<int> nums;
	nums.push_back(3);
	nums.push_back(2);
	nums.push_back(4);
	nums.push_back(6);
	cr::priority_queue<int, vector<int>, cr::Greater<int>> pq(nums.begin(), nums.end());
	cout << endl;
	while (!pq.empty())
	{
		cout << pq.top() << endl;
		pq.pop();
	}

	return 0;
}